Euclidean Algorithm for Laurent Polynomial Matrix Extension
نویسنده
چکیده
In this paper, we develop a novel and effective Euclidean algorithm for Laurent polynomial matrix extension (LPME), which is the key of the construction of perfect reconstruction filter banks (PRFBs). The algorithm simplifies the dual-chain approach to the construction of PRFBs in the paper [5]. The algorithm in this paper can also be used in the applications where LPME plays a role.
منابع مشابه
Euclidean Algorithm for Extension of Symmetric Laurent Polynomial Matrix and Its Application in Construction of Multiband Symmetric Perfect Reconstruction Filter Bank
For a given pair of s-dimensional real Laurent polynomials (~a(z),~b(z)), which has a certain type of symmetry and satisfies the dual condition~b(z) T ~a(z) = 1, an s× s Laurent polynomial matrix A(z) (together with its inverse A−1(z)) is called a symmetric Laurent polynomial matrix extension of the dual pair (~a(z),~b(z)) if A(z) has similar symmetry, the inverse A−1(Z) also is a Laurent polyn...
متن کاملElementary Matrix Decomposition Algorithm for Symmetric Extension of Laurent Polynomial Matrices and its Application in Construction of Symmetric M-band Filter Banks
In this paper, we develop a novel and effective algorithm for the construction of perfect reconstruction filter banks (PRFBs) with linear phase. In the algorithm, the key step is the symmetric Laurent polynomial matrix extension (SLPME). There are two typical problems in the construction: (1) For a given symmetric finite low-pass filter a with the polyphase, to construct a PRFBs with linear pha...
متن کاملAn Algorithm for Matrix Extension and Wavelet Construction 3
This paper gives a practical method of extending an nr matrix P (z), r n, with Laurent polynomial entries in one complex variable z, to a square matrix also with Laurent polynomial entries. If P (z) has orthonormal columns when z is restricted to the torus T, it can be extended to a paraunitary matrix. If P (z) has rank r for each z 2 T, it can be extended to a matrix with nonvanishing determin...
متن کاملAn algorithm for matrix extension and wavelet construction
This paper gives a practical method of extending an n× r matrix P (z), r ≤ n, with Laurent polynomial entries in one complex variable z, to a square matrix also with Laurent polynomial entries. If P (z) has orthonormal columns when z is restricted to the torus T, it can be extended to a paraunitary matrix. If P (z) has rank r for each z ∈ T, it can be extended to a matrix with nonvanishing dete...
متن کاملMatrix Extension with Symmetry and Its Application to Filter Banks
Let P be an r×smatrix of Laurent polynomials with symmetry such that P(z)P∗(z) = Ir for all z ∈ C\{0} and the symmetry of P is compatible. The matrix extension problem with symmetry is to find an s × s square matrix Pe of Laurent polynomials with symmetry such that [Ir,0]Pe = P (that is, the submatrix of the first r rows of Pe is the given matrix P), Pe is paraunitary satisfying Pe(z)Pe(z) = Is...
متن کامل